Distribution-Independent Inventory Approach under Multiple Service Level Targets

ABSTRACT

A system and method are disclosed for an inventory planner that generates an inventory policy using any form of demand distributions, non-linear cost functions and/or multiple target measures of service levels, while taking into account a supply order lead time, such as, for example, a static or stochastic supply order lead time. The inventory policy generated by the inventory planner comprises an optimal and reproducible solution to one or more supply chain planning problems.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No. 17/224,461, filed on Apr. 7, 2021, entitled “Distribution-Independent Inventory Approach under Multiple Service Level Targets,” which is a continuation of U.S. patent application Ser. No. 15/011,953, filed on Feb. 1, 2016, entitled “Distribution-Independent Inventory Approach under Multiple Service Level Targets,” now U.S. Pat. No. 10,977,609, which claims the benefit under 35 U.S.C. § 119(e) to U.S. Provisional Application No. 62/175,404, filed Jun. 14, 2015, and entitled “A Distribution-Independent Inventory Optimization Approach under Multiple Service Level Targets.” U.S. patent application Ser. No. 17/224,461, U.S. Pat. No. 10,977,609, and U.S. Provisional Application No. 62/175,404 are assigned to the assignee of the present application.

TECHNICAL FIELD

The disclosure relates generally to a system and method of supply chain inventory management, and more particularly, to a system and method of generating an inventory policy.

BACKGROUND

Supply chain inventory management involves developing an inventory policy that aims to minimize the total cost of activities related to inventory and replenishment by determining when to order an item and what quantities should be placed in the order. An inventory policy may be assessed by service level targets because the execution of a good inventory policy will result in an actual service level meeting or exceeding one or more predefined target service levels. To determine a target service level, an enterprise must consider projected demand and costs. Predicting a service level is similar to predicting the probability of being in a future state after some number of periods, or even an infinite number of periods. However, predicting an inventory policy while taking into account non-standard demand distributions, uncertain lead times, complex cost functions, and multiple target service levels is difficult to efficiently or accurately accomplish. Therefore, previous methods of determining inventory policies while attaining a target service level have proven inadequate.

BRIEF DESCRIPTION OF THE DRAWINGS

A more complete understanding of the present invention may be derived by referring to the detailed description when considered in connection with the following illustrative figures. In the figures, like reference numbers refer to like elements or acts throughout the figures.

FIG. 1 illustrates an exemplary supply chain network according to a first embodiment;

FIG. 2 illustrates the inventory planner of FIG. 1 in greater detail in accordance with the first embodiment; and

FIG. 3 illustrates an exemplary method of generating an inventory policy by the inventory planner of FIG. 1 in accordance with an embodiment.

DETAILED DESCRIPTION

Aspects and applications of the invention presented herein are described below in the drawings and detailed description of the invention. Unless specifically noted, it is intended that the words and phrases in the specification and the claims be given their plain, ordinary, and accustomed meaning to those of ordinary skill in the applicable arts.

In the following description, and for the purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the various aspects of the invention. It will be understood, however, by those skilled in the relevant arts, that the present invention may be practiced without these specific details. In other instances, known structures and devices are shown or discussed more generally in order to avoid obscuring the invention. In many cases, a description of the operation is sufficient to enable one to implement the various forms of the invention, particularly when the operation is to be implemented in software. It should be noted that there are many different and alternative configurations, devices and technologies to which the disclosed inventions may be applied. The full scope of the inventions is not limited to the examples that are described below.

FIG. 1 illustrates an exemplary supply chain network 100 according to a first embodiment. Supply chain network 100 comprises an inventory planner 110, one or more supply chain entities 120, computers 130, a network 140, and communication links 142, 144, and 146. Although a single inventory planner 110, one or more supply chain entities 120, a single computer 130, and a single network 140, are shown and described; embodiments contemplate any number of inventory planners 110, any number of supply chain entities 120, any number of computers 130, or any number of networks 140, according to particular needs.

In one embodiment, inventory planner 110 generates an inventory policy using one or more demand distributions, non-linear cost functions and/or target service levels, while taking into account a static or stochastic supply order lead time.

Supply chain network 100 may operate on one or more computers 130 that are integral to or separate from the hardware and/or software that support inventory planner 110 and one or more supply chain entities 120. Computers 130 may include any suitable input device 132, such as a keypad, mouse, touch screen, microphone, or other device to input information. An output device 134 may convey information associated with the operation of supply chain network 100, including digital or analog data, visual information, or audio information. Computers 130 may include fixed or removable non-transitory computer-readable storage media, such as magnetic computer disks, CD-ROM, or other suitable non-transitory computer-readable storage media to receive output from and provide input to supply chain network 100. Computers 130 may include one or more processors 136 and associated memory to execute instructions and manipulate information according to the operation of supply chain network 100.

Although a single computer 130 is shown and described in FIG. 1 , inventory planner 110 and one or more supply chain entities 120 may each operate on separate computers 130 or may operate on one or more shared computers 130. Each of the one or more computers 130 may be a work station, personal computer (PC), network computer, tablets, notebook computer, personal digital assistant (PDA), cell phone, smartphone, telephone, wireless data port, or any other suitable computing device. In an embodiment, one or more users may be associated with inventory planner 110. These one or more users may include, for example, a “manager” or a “planner” handling generating inventory policies and/or one or more related tasks within supply chain network 100. In addition, or as an alternative, these one or more users within supply chain network 100 may include, for example, one or more computers 130 programmed to autonomously handle, among other things, generating an inventory policy, forecasting a demand, and adjusting of various levels of manufacturing and inventory based, at least in part, on the inventory policy and/or one or more related tasks within supply chain network 100.

As an example only and not by way of limitation, one or more supply chain entities 120 may represent one or more supply chain entities, such as, for example, suppliers, manufacturers, distribution centers, retailers (including online retailers) and/or customers. A supplier may be any suitable entity that offers to sell or otherwise provides one or more items (i.e., materials, components, or products) to one or more manufacturers. In addition, or as an alternative, each of the one or more items may be represented in supply chain network 100 by an identifier, including, for example, Stock-Keeping Unit (SKU), Universal Product Code (UPC) information, or a barcode, tag, RFID, or any other device that encodes such identifying information.

A manufacturer may be any suitable entity that manufactures at least one product. Manufacturer may use one or more items during the manufacturing process to produce any manufactured, fabricated, assembled, or otherwise processed and tangible item, material, component, good or product. In one embodiment, a product represents an item ready to be supplied to, for example, another supply chain entity in one or more supply chain entities 120, such as a supplier, an item that needs further processing, or any other item. A manufacturer may, for example, produce and sell a product to one or more suppliers, another manufacturer, one or more distribution center, one or more retailers, a customer, or any other suitable person or entity. A distribution center may be any suitable entity that offers to store or otherwise distributes at least one product to one or more retailers and/or customers. A retailer may be any suitable entity that obtains one or more products to sell to one or more customer, whether as a brick and mortar retailer or an online retailer.

Although one or more supply chain entities 120 is shown and described as separate and distinct entities, the same entity may simultaneously act as any one of the one or more supply chain entities 120. For example, one or more supply chain entities 120 acting as manufacturer can produce a product, and the same entity can act as supplier to supply an item to itself or another supply chain entity. In addition, or as an alternative, embodiments contemplate any number of suppliers, manufactures, distribution centers and retailers, according to particular needs. Although one example of a supply chain network 100 is shown and described, embodiments contemplate any operational environment and/or supply chain network 100, without departing from the scope described herein.

In one embodiment, inventory planner 110 is coupled with network 140 using communications link 142, which may be any wireline, wireless, or other link suitable to support data communications between inventory planner 110 and network 140 during operation of supply chain network 100. One or more supply chain entities 120 are coupled with network 140 using communications link 144, which may be any wireline, wireless, or other link suitable to support data communications between one or more supply chain entities 120 and network 140 during operation of supply chain network 100. Computers 130 are coupled with network 140 using communications link 146, which may be any wireline, wireless, or other link suitable to support data communications between computers 130 and network 140 during operation of supply chain network 100.

Although communication links 142, 144, and 146, and are shown as generally coupling inventory planner 110, one or more supply chain entities 120, and computers 130 to network 140, inventory planner 110, one or more supply chain entities 120, and computers 130 may communicate directly with inventory planner 110, one or more supply chain entities 120, and computers 130, according to particular needs.

In another embodiment, network 140 includes the Internet and any appropriate local area networks (LANs), metropolitan area networks (MANs), or wide area networks (WANs) coupling inventory planner 110, one or more supply chain entities 120, and computers 130. For example, data may be maintained by inventory planner 110 at one or more locations external to inventory planner 110 and one or more supply chain entities 120 and made available to one or more associated users of one or more supply chain entities 120 using network 140 or in any other appropriate manner. Those skilled in the art will recognize that the complete structure and operation of communication network 140 and other components within supply chain network 100 are not depicted or described. Embodiments may be employed in conjunction with known communications networks 140 and other components.

In accordance with the principles of embodiments described herein, inventory planner 110 may generate an inventory policy for inventory of one or more supply chain entities 120 in supply chain network 100. Furthermore, inventory planner 110 may adjust product mix ratios, inventory levels at various stocking points, production of products of manufacturing equipment, and proportional or alternative sourcing of one or more supply chain entities 120 based on one or more generated inventory policies.

According to some embodiments, inventory planner 110 generates an inventory policy based on an item demand distribution for a given cost function. According to these embodiments, when the inventory quantity of an item reaches a quantity s or lower, the item may be resupplied to reach a target quantity of S. The cost function may include, but is not restricted to, inventory costs, order costs and backorder costs. In addition, or as an alternative, the cost function may be complex and include, for example, step function costs and other non-linear costs functions of inventory and order quantities.

According to an embodiment, inventory planner 110 receives a discrete demand probability distribution for one or more items and a set of related cost values. Inventory planner 110 may then determine an inventory policy that minimizes costs based on the received demand distribution for every period of a planning horizon that meets one or more service level targets.

Service level targets may include a set of service level targets based on different possible measures of service level, such as, for example, the probability of satisfying the entire demand during a period and the fraction of demand that would be satisfied. In addition, or as an alternative, during the solution process, a negative difference with the targeted service level may be penalized.

According to embodiments, inventory planner 110 models a supply chain resupply problem as a Markov decision process (MDP) where the model comprises transition matrices and reward matrices. Embodiments of the disclosed system and method utilize linear programming (LP) and mixed integer linear programming (MILP) models to solve variants of the MDP models for inventory policies. Variants of MDP models permit planning for an infinite horizon MDP with seasonality and time steps, and an infinite horizon MDP model with no seasonality. Infinite horizon MDP with seasonality may comprise a dynamic policy (including, for example, one policy per season) and/or a static policy (including, for example, one policy for more than one, or all, seasons).

To further explain the operation of the disclosed system, an example of a simplified inventory planning problem is now given. In the following exemplary embodiment, the simplified inventory planning problem may comprise a household's decision to purchase milk for breakfast. The milk represents an exemplary item in a supply chain inventory. According to this example, an individual wants to purchase some milk (but not too much milk) so that the individual's household will be supplied each morning with milk for breakfast cereal. In this example, milk represents an item in inventory. The individual represents a supply chain entity, such as a buyer. The time it takes to buy the milk represents the leadtime. And the storage of the milk in the refrigerator represents storage and/or carrying costs. For example, due to limited storage space at a warehouse (represented, in this example, by a refrigerator), storing too much milk in the refrigerator may prevent the storage of other items in the warehouse (such as other food items), which represents the storage and/or costs.

In order to solve this simplified inventory planning problem, inventory planner 110 takes into account the past habits of the household and/or individual, such as the probability of drinking milk at different periods, and assigning a cost to each of: buying milk (representing an order), losing some milk (representing waste), and not having enough milk (representing a stockout). Based on these input variables, comprising demand probabilities and costs, inventory planner 110 may find a buying policy, such as a milk buying policy, at each period. Such a milk buying policy may comprise, for example, when the inventory of milk contains s or less items and when an order is made to reach level S.

FIG. 2 illustrates inventory planner 110 of FIG. 1 in greater detail in accordance with the first embodiment. As discussed above, inventory planner 110 comprises one or more computers at one or more locations including associated input devices, output devices, non-transitory computer-readable storage media, processors, memory, or other components for receiving, processing, storing, and communicating information according to the operation of supply chain network 100. As discussed in more detail below, inventory planner 110 comprises one or more of computers, server 210, and database 220. Although inventory planner 110 is shown as comprising a single computer, server 210 and database 220; embodiments contemplate any suitable number of computers, servers or databases internal to or externally coupled with inventory planner 110. In addition, or as an alternative, inventory planner 110 may be located internal to one or more retailers of one or more supply chain entities 120. In other embodiments, inventory planner 110 may be located external to one or more retailers of one or more supply chain entities 120 and may be located in for example, a corporate retailer of the one or more retailers, according to particular needs.

Server 210 comprises inventory modeler 212, decision process solver 214, and inventory policy generator 216. Although server 210 is shown and described as comprising a single inventory modeler 212, decision process solver 214, and inventory policy generator 216, embodiments contemplate any suitable number or combination of these located at one or more locations, local to, or remote from inventory planner 110, such as on multiple servers or computers at any location in supply chain network 100.

Database 220 comprises one or more databases or other data storage arrangement at one or more locations, local to, or remote from, server 210. Database 220 comprises, for example, demand data 222, leadtime data 224, cost data 226, service level data 228, data models 230, transition matrices 232, reward matrices 234, order rules 236, explanatory variables 238, forecast data 240, inventory policy parameters 242 and replenishment rules 244. In one embodiment, database 220 stores supply chain data, including one or more inventory planning problems of supply chain network 100 that may be used by server 210. Although, database 220 is shown and described as comprising demand data 222, leadtime data 224, cost data 226, service level data 228, data models 230, transition matrices 232, reward matrices 234, order rules 236, explanatory variables 238, forecast data 240, inventory policy parameters 242 and replenishment rules 244, embodiments contemplate any suitable number or combination of these, located at one or more locations, local to, or remote from, inventory planner 110 according to particular needs.

In one embodiment, inventory modeler 212 models an inventory planning problem as a decision process according to data models 230 and generates transition matrices 232 and reward matrices 234 based at least in part on received demand data 222, leadtime data 224, cost data 226, and/or service level data 228. In addition, or as an alternative, inventory modeler 212 models the supply chain planning problem as a MDP. According to an embodiment, a MDP is a dynamic programming algorithm characterized by a discrete time period and a stochastic transition over discrete demand distributions.

Decision process solver 214 may receive transition matrices 232 and reward matrices 234 as inputs and generate a decision process solution modeled according to data models 230. According to an embodiment, the decision process is solved by linear programming (LP), and/or mixed-integer linear programming (MILP) solvers.

Inventory policy generator 216 may comprise one or more modules of inventory planner 110 that generate an inventory policy from the decision process solution generated by the decision process solver 214 for a single item in each location. The generated inventory policy may include one or more performance measures such as stockout probability, fulfillment level, waiting time, maximum backlog quantity, and/or a number of orders. According to an embodiment, policy generator 216 produces an (s, S) resupply policy that indicates, when an inventory quantity reaches the quantity of s, it should be resupplied to reach a quantity of S.

In one embodiment, demand data 222 of database 220 may comprise for example, any data relating to past sales, past demand, purchase data, promotions, events, or the like of one or more supply chain entities 120. Demand data 222 may be stored at time intervals such as, for example, by the minute, hour, daily, weekly, monthly, quarterly, yearly, or any suitable time interval, including substantially in real time. According to embodiments, demand data 222 includes a demand function, comprising demand values and probabilities. For a historical demand, a demand function may comprise probabilities calculated from a frequency associated with demand value for one or more time steps. According to some embodiments, the demand function comprises a slow mover predictive model which comprises a distributional forecast.

Leadtime data 224 of database 220 may comprise discrete leadtime distributions or historical leadtimes of one or more items of supply chain entities 120. Leadtime data 224 may represent the time elapsing from when an order for the item is communicated to one or more supply chain entities 120 until the item is received in an inventory. According to embodiments, leadtime data 224 comprises a leadtime function comprising lead time values and probabilities associated with each lead time value for one or more time steps.

According to embodiments, inventory planner 110 receives demand data 222 and leadtime data 224 and generates transition matrices 232. Demand data 222 and leadtime data 224 may comprise various forms of standard or non-standard distributions. As an example only and not by way of limitation, inventory planner 110 may generate an inventory policy for standard or non-standard historical demand and lead-time or other non-standard uncertainty distributions. Examples of historical demand that do not follow standard distributions include, but are not limited to, slow moving items that have a large number of zero demand and items with lumpy demand patterns.

Cost data 226 may comprise any one or more general cost components of one or more items in supply chain network 100, such as, for example, batch costs, stock out costs, inventory costs, order costs, backorder costs, and backlog costs. In addition, or as an alternative, the cost function may be complex, such as for example, step-size cost functions of inventory and order quantities and other non-linear costs functions of inventory and order quantities. A step-size cost function may comprise a cost related to each block of a group of items. For example, given a group of items that are sold in blocks of 100 or less, 105 items would cost the same as 115 items, but 205 items would cost more. A non-linear cost function may comprise, for example, a quadratic function of the inventory quantity and order quantity. According to some embodiments, cost data 226 comprises an assigned cost associated with a service level target that are incorporated into reward matrices 234. A non-linear cost function may be useful when a fixed cost is associated with a certain level of inventory quantity (for example, a physical storage has a fixed bin size and an inventory holding cost is a fixed cost per bin) or when an inventory cost increases exponentially because the capacity of the physical storage reaches the effective capacity level, and it becomes more difficult to operate, thereby significantly reducing the operational efficiency.

According to embodiments, cost data 226 may comprise a cost parameter c_(iq) ^(t), associated with an inventory level i, order quantity q, at a time step t. For example, according to embodiments, cost parameter c_(iq) ^(t) may be calculated from one or more cost components according to:

c _(iq) ^(t)=

_(i) ^(t) +v _(q) ^(t)−μ_(s)·min{i,0}

where,

_(i) ^(t) is an inventory cost at time step t as a function of inventory level i;

v_(q) ^(t) is an order cost at time step t as a function of order quantity q; and

ρ_(s) is a stockout cost per unit of one or more products.

In addition, or as an alternative, embodiments contemplate cost functions comprising any function of order quantity q without further modification. By way of example and not limitation, cost function may comprise a step-size cost function, such as, for example, a ceiling function:

$v_{q}^{t} = {\left\lceil \frac{q}{v} \right\rceil u}$

where, cost increases by u, for every group of items v ordered.

Service level data 228 comprises data of one or more service level targets. Service level targets may comprise any suitable service level target, such as, for example, a stockout probability, fulfillment level, expected wait time and/or average stock on hand. Particular examples of service level targets stored in database 220 may comprise, for example, a stockout probability less than or equal to 10%, a fulfillment level (by quantity) greater than or equal to 5%; an expected wait time less than or equal to 2 days; and/or an average stock on hand greater than or equal to an expected “positive” demand. Although, particular service level targets are described; embodiments contemplate any service level target, according to particular needs.

In addition, or as an alternative, service level targets may be implemented as a cost in cost data 226 in order to generate a penalty in determining an inventory policy.

According to embodiments, one or more service level targets are modeled as costs by associating a sufficiently large penalty when a service level fails to meet service level target, thereby enforcing these constraints in the inventory policy. These costs may be used to determine if an order quantity (action) associated with an inventory level (state) would satisfy one or more predetermined service level targets. According to some embodiments, service level targets are implemented into cost data 226 as one or more of a stockout probability, maximum backlog quantity, and/or a fulfillment level.

According to an embodiment, a stockout probability may be calculated according to a transition matrix that describes the probability of an item in an inventory moving from a first state to a second or more states. According to the matrix, as will be explained more fully below, one matrix per order action q is defined because the action changes the probability of transition between states. Each pair of state and order action is associated to a vector of probabilities of transition to another state. By summing the probabilities over one or more backlog states, the stockout probability for an initial state i and order quantity q combination is determined. When the probability of a stockout is more than 1 minus the target service level, a large penalty may be added to the cost parameter, c_(iq) ^(t).

Additionally, or in the alternative, a service level target may represent a maximum backlog quantity. According to embodiments, a maximum backlog quantity may be generated for each state i and order action q. Using a vector of transition probabilities, the expected backlog quantity may be generated by averaging the backlog quantity corresponding to each stockout state weighted by a probability of moving into a corresponding state. When the expected backlog quantity is greater than the target maximum backlog quantity, a large penalty may be added to the cost parameter c_(iq) ^(t).

According to further embodiments, a service level target may comprise a fulfillment level, which may represent the proportion of the demand that is to be satisfied. An expected fulfillment quantity may comprise for example, the expected demand minus the expected backlog quantity. The fulfillment level may be obtained by dividing the expected fulfillment quantity by the expected demand. The expected backlog quantity computed for the maximum backlog quantity may also be used to determine if an action q associated with a state i satisfies the fulfillment level. The expected backlog quantity may then be converted into an expected fulfillment level. If the expected fulfillment level is less than a targeted fulfillment level, a large penalty may be added to the cost parameter c_(iq) ^(t).

As an example only and not by way of limitation, inventory planner 110 may set a preferred service level target. Inventory modeler 212 may associate each service level target with a cost that may be incorporated into reward matrices 234, such that a penalty is applied when an inventory policy comprises a service level different than a target service level. According to some embodiments, a higher service level may be preferred to a lower service level when compared to the target service level. In other words, missing more sales than set in a service level target may be worse than having excess inventory, because excess inventory may carry lower costs than missed sales. For example, if the service level target is 95%, then a service level of 96% may be preferred to a service level 94%. This concept may be included in the reward matrix by applying a larger penalty if the service level is under the target service level, than if the service level is over the target service level. According to some embodiments, a penalty is set equivalent to the distance from the target service level. In this manner, inventory planner 110 may impose multiple target service levels using a similar treatment. According to an embodiment, inventory planner 110 generates an inventory policy that satisfies multiple service level targets.

Data models 230 may comprise any suitable model of the described data stored in database 220. Transition matrices 232 may comprise one or more mathematical matrices or data structures that comprises data generated by inventory modeler 212 that defines the probability of moving from each possible inventory state to another during a period. Reward matrices 234 may comprise one or more mathematical matrices or data structures that comprises data generated by inventory modeler 212 that defines the cost associated with each inventory state and the order action taken during a period. According to an embodiment, the costs of the reward matrix is a function of the state and period and can be defined in any form such as, for example, a linear function or a non-linear function, such as, for example, a step function.

Transition matrices 232 and reward matrices 234 are used by decision process solver 214 to generate a decision process solution based on one or more of demand data 222, leadtime data 224, cost data 226, and service level data 228. A decision process solution may then be used by policy generator 216 to generate an inventory policy.

Order rules 236 may comprise one or more rules or limits on setting an inventory policy, including, but not limited to, a minimum order quantity, a maximum order quantity, a discount, and a step-size order quantity, and batch quantity rules. According to an embodiment, inventory planner 110 generates an inventory policy when based, at least in part, on order rules 236.

Explanatory variables 238 may comprise data relating to specific past, current, or future indicators and data of promotions, seasonality, special events (such as sporting events), weather, and the like. According to some embodiments, inventory planner 110 accesses and stores explanatory variables 238 in the database. These explanatory variables may be used to create time dependent cost parameters and transition matrices that are consumed by a time dependent model.

In one embodiment, inventory planner 110 stores forecast data 240 in database 220. Forecast data 240 may comprise data relating to a forecast generated by inventory planner 110 in response to historical data 222 and explanatory variables 238 according to data models 230. Forecast data 240 may include, for example, future predicted sales, future predicted demand, replenishment quantity of inventory, parameters of the distributional forecasts, and any data or representations of data (such as graphs, charts, tables, matrices, and the like) generated by inventory planner 110 from historical data 222, according to particular needs.

Inventory policy parameters 242 are calculated by inventory planner 110 from a forecasted demand to ensure that a service level of one or more supply chain entities 120 is met with a certain probability. Inventory policy parameters 242 may comprise any suitable service level target, as described above. According to some embodiments, one or more supply chain entities 120 set a service level at 95%, meaning supply chain entities 120 will set the desired inventory stock level at a level that meets demand 95% of the time. Although, a particular service level percentage is described; embodiments contemplate any service level, for example, a service level of approximately 99% through 90%, a 75% service level, or any suitable service level, according to particular needs. Other types of service levels associated with inventory quantity or order quantity may comprise, but are not limited to, a maximum expected backlog and a fulfillment level. Once the service level is set, inventory planner 110 generates a replenishment order according to one or more replenishment rules 244, which, among other things, indicates to one or more supply chain entities 120 to generate or receive inventory to replace depleted inventory. Replenishment rules 234 may indicate that, for example, when a specified condition occurs, a supplier or distribution center is directed to ship one or more products, a manufacturer is directed to manufacture one or more products, and/or a retailer is directed to receive one or more products to replenish a depleted inventory.

FIG. 3 illustrates an exemplary method 300 of generating an inventory policy by inventory planner 110 according to an embodiment. Method 300 proceeds by one or more activities, which although described in a particular order may be performed in one or more permutations, according to particular needs. According to some embodiments, method 300 generally assumes that an additional order cannot be placed if there exists already an order in-transit. However, embodiments contemplate relaxing this assumption by adding any in-transit quantity orders of one or more items to a projected inventory quantity in future periods and generating an inventory policy based on the new quantity. Furthermore, depending on the inventor planning model, method 300 may generate an inventory policy for each time step, or by utilizing one or more additional constraints and integer variables, method 300 may generate a consistent inventory policy across multiple time steps.

Method 300 of generating an inventory policy begins at activity 302 where inventory planner 110 receives demand probabilities or a demand distribution from demand data 222 for a given item including a set of cost values. Further, inventory planner 110 may receive and utilize demand data 222, leadtime data 224, cost data 226, service level data 228, and/or other data from database 220.

At activity 304, inventory modeler 212 of inventory planner 110 generates a transition matrix based on the received demand data 222. According to an embodiment, the states of the generated transition matrix comprise the possible number of items in the inventory at each period and the demands that cannot be satisfied (or are backlogged) are represented by negative inventory quantities. The infinite MDP model may comprise additional states, called absorbing states, which prevent an inventory state that is larger than the capacity of the inventory or an unacceptable stockout level. According to an embodiment, the absorbing states comprise states of the supply chain system which are impossible to reach and no action has any impact on these states. The only transition permitted on the absorbing states is to stay in the state. A large negative reward (penalty) may be associated with the absorbing states to ensure the MDP solution has no advantage to end in those states.

As an example only and not by way of limitation, beginning with the set, P^(l)=[−b, . . . , 0, . . . , u, u+1], is the set of inventory states associated with the demand lead time l, where b is the maximum backlog possible (equal to the maximum ordering quantity for one period), and u is the maximum inventory quantity, the transition matrix states are equal to P. The additional state after u is an absorbing state, which may be associated with a high penalty that limits the size of the inventory. For simplicity, the absorbing state for an unacceptable backlog level is not illustrated in the example given here. From a demand probability distribution of size b+1 ranging from 0 to b, the matrix may be constructed with the following assumptions.

The probability of staying in state s is equal to the probability of not having any demand. The probability of moving from state s to s−d is equal to the probability of having a demand of d items during a single time step. Moving from state s₁ to s₂ where s₁<s₂ is impossible if no order is made.

Let i be a state of the inventory. The possible order quantities may be represented by the set Q and the maximum ordering quantity is equal to q^(max)=max_(q∈Q). An example of discrete demand probabilities is shown in Equation 1.

$\begin{matrix} \begin{matrix} 0 & 1 \\ \left\lbrack 0.87 \right. & \left. 0.13 \right\rbrack \end{matrix} & (1) \end{matrix}$

According to the example in Equation 1, during a time step, there is a probability of 0.87 to have no demand and a probability 0.13 to have one demand. Based on these probabilities, the resulting transition matrix, if no order is made (i.e. q=0) is equal to Matrix 2.

$\begin{matrix} {P_{0}^{1} = {\begin{matrix} \begin{matrix} \begin{matrix} \begin{matrix} \begin{matrix} \begin{matrix} \begin{matrix} {- 2} \\ {- 1} \end{matrix} \\ 0 \end{matrix} \\ 1 \end{matrix} \\ 2 \end{matrix} \\ 3 \end{matrix} \\ 4 \end{matrix} \\ 5 \end{matrix}\begin{matrix} \begin{matrix} \begin{matrix} \begin{matrix} \begin{matrix} \begin{matrix} \begin{matrix} \begin{matrix} {- 2} & {- 1} \end{matrix} & 0 \end{matrix} & 1 \end{matrix} & 2 \end{matrix} & 3 \end{matrix} & 4 \end{matrix} & 5 \end{matrix} \\ \begin{bmatrix} 0 & 0.13 & 0.87 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0.13 & 0.87 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0.13 & 0.87 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0.13 & 0.87 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0.13 & 0.87 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0.13 & 0.87 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0.13 & 0.87 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 \end{bmatrix} \end{matrix}}} & (2) \end{matrix}$

The resulting transition matrix when an order of one is made (i.e. q=1) is equal to Matrix 3.

$\begin{matrix} {P_{1}^{1} = {\begin{matrix} \begin{matrix} \begin{matrix} \begin{matrix} \begin{matrix} \begin{matrix} \begin{matrix} {- 2} \\ {- 1} \end{matrix} \\ 0 \end{matrix} \\ 1 \end{matrix} \\ 2 \end{matrix} \\ 3 \end{matrix} \\ 4 \end{matrix} \\ 5 \end{matrix}\begin{matrix} \begin{matrix} \begin{matrix} \begin{matrix} \begin{matrix} \begin{matrix} \begin{matrix} \begin{matrix} {- 2} & {- 1} \end{matrix} & 0 \end{matrix} & 1 \end{matrix} & 2 \end{matrix} & 3 \end{matrix} & 4 \end{matrix} & 5 \end{matrix} \\ \begin{bmatrix} 0 & 0 & 0.13 & 0.87 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0.13 & 0.87 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0.13 & 0.87 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0.13 & 0.87 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0.13 & 0.87 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0.13 & 0.87 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 \end{bmatrix} \end{matrix}}} & (3) \end{matrix}$

When the inventory is in a backlogged state (i<0), an order of max (q^(max), |i|) is made. According to embodiments, this forces the inventory to exit the backlogged state at each period or time step.

The reward matrix of activity 304 may be constructed differently depending on whether the lead time is deterministic or stochastic. A time dependent demand model may be used when an inventory problem comprises seasonality, while the stochastic lead time may still be taken into account by parameterizing transition probabilities. In a time independent model, transition probabilities may be aggregated over the stochastic lead time to a single matrix for each action state.

According to embodiments with a time dependent demand, the demand distribution of a stochastic distribution over l periods is generated by multiplying the transition matrix P₀ ¹ by itself l times. From the resulting matrix, any row where i≥0 may be used to obtain the demand distribution. By way of example and not by limitation, when the probabilities from Matrix 2 are aggregated over a lead time of two periods, inventory modeler 212 generates an aggregate demand function, Vector 4:

$\begin{matrix} \begin{matrix} \begin{matrix} \begin{matrix} 0 & 1 \end{matrix} & 2 \end{matrix} \\ \begin{bmatrix} \begin{matrix} 0.7569 & 0.2262 \end{matrix} & 0.0169 \end{bmatrix} \end{matrix} & (4) \end{matrix}$

From these probabilities and states, a transition Matrix 5, P₀ ², with no orders is generated.

$\begin{matrix} {P_{0}^{2} = {\begin{matrix} \begin{matrix} \begin{matrix} \begin{matrix} \begin{matrix} \begin{matrix} \begin{matrix} {- 2} \\ {- 1} \end{matrix} \\ 0 \end{matrix} \\ 1 \end{matrix} \\ 2 \end{matrix} \\ 3 \end{matrix} \\ 4 \end{matrix} \\ 5 \end{matrix}\begin{matrix} \begin{matrix} \begin{matrix} \begin{matrix} \begin{matrix} \begin{matrix} \begin{matrix} \begin{matrix} {- 2} & {- 1} \end{matrix} & 0 \end{matrix} & 1 \end{matrix} & 2 \end{matrix} & 3 \end{matrix} & 4 \end{matrix} & 5 \end{matrix} \\ \begin{bmatrix} 0.0169 & 0.2262 & 0.7569 & 0 & 0 & 0 & 0 & 0 \\ 0.0169 & 0.2262 & 0.7569 & 0 & 0 & 0 & 0 & 0 \\ 0.0169 & 0.2262 & 0.7569 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0.0169 & 0.2262 & 0.7569 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0.0169 & 0.2262 & 0.7569 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0.0169 & 0.2262 & 0.7569 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0.0169 & 0.2262 & 0.7569 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 \end{bmatrix} \end{matrix}}} & (5) \end{matrix}$

For an order of one (q=1), the transition matrix, Matrix 6, is generated.

$\begin{matrix} {P_{1}^{2} = {\begin{matrix} \begin{matrix} \begin{matrix} \begin{matrix} \begin{matrix} \begin{matrix} \begin{matrix} {- 2} \\ {- 1} \end{matrix} \\ 0 \end{matrix} \\ 1 \end{matrix} \\ 2 \end{matrix} \\ 3 \end{matrix} \\ 4 \end{matrix} \\ 5 \end{matrix}\begin{matrix} \begin{matrix} \begin{matrix} \begin{matrix} \begin{matrix} \begin{matrix} \begin{matrix} \begin{matrix} {- 2} & {- 1} \end{matrix} & 0 \end{matrix} & 1 \end{matrix} & 2 \end{matrix} & 3 \end{matrix} & 4 \end{matrix} & 5 \end{matrix} \\ \begin{bmatrix} 0 & 0.0169 & 0.2262 & 0.7569 & 0 & 0 & 0 & 0 \\ 0 & 0.0169 & 0.2262 & 0.7569 & 0 & 0 & 0 & 0 \\ 0 & 0.0169 & 0.2262 & 0.7569 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0.0169 & 0.2262 & 0.7569 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0.0169 & 0.2262 & 0.7569 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0.0169 & 0.2262 & 0.7569 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 \end{bmatrix} \end{matrix}}} & (6) \end{matrix}$

According to embodiments with a time independent demand, transition matrices associated with each lead time value may be further aggregated into a single transition matrix for each order quantity. By way of example not by limitation, stochastic leadtime may be incorporated through the transition matrix P₀ ¹ (Matrix 2) above. Assuming a leadtime of [(1, 0.5), (2, 0.3), (3, 0.2)], where a list of pairs matches each lead duration to a probability, then the demand probability may be generated by the following procedure with P₀ ¹ and the list of pairs as inputs:

Algorithm 1 Algorithm to compute  the stochastic leadtime 1: procedure COMPUTE STOCHASTIC LEADTIME(P₀ ¹,  stochastic_leadtime) 2:  for (l, leadtime_probability) ∈  stochastic_leadtime do 3:   first_row ← (P₀ ¹)^(l) _(1,i) ∀i ∈ 1..|P₀ ¹| 4:   d_(l) ← first_row · leadtime_probability 5:  end for 6:  return Σ_(i∈L) d_(l) 7: end procedure

where, for each pair, a set of demand probabilities may be retrieved from the first row of P₀ ¹ ^(l) , where l is the lead time duration. The new demand probability may then be generated as a weighted sum of the probability of each lead time duration.

Inventory modeler 212 generates one or more additional transition matrices for other items in supply chain network 100 according to particular needs. According to some embodiments, inventory modeler 212 uses a basic single-product model where all periods have the same discrete demands probabilities, which results in a Markov decision process over an infinite horizon.

At activity 306, inventory modeler 212 of inventory planner 110 generates a reward matrix based, at least in part, on one or more costs of cost data 226 which depend on an inventory state and an order action. According to an embodiment, for each action, inventory modeler 212 defines, in the reward matrix, a cost associated with each possible state, where a reward is the cost associated with each action in each state (i.e. inventory quantity) and penalties are associated with a service level violation. This cost is equal to the sum of all functions, such as inventory cost or backlog cost for this particular action and state. These functions take as input the action and inventory state and return an associated cost.

According to some embodiments, each action, R_(q) is a reward matrix of size |l^(t)|×|T|, which defines a cost for each inventory state i related to the ordering action q at time step t: c_(iq) ^(t), where Tis the set of time steps and I^(t) is a set of inventory levels in time step t ∈ T.

At activity 308, inventory planner 110 generates an inventory planning model. For the model described below, the following notation is used. Let, T be the set of time steps, I^(t) is a set of inventory levels in time step t ∈ T, Q is the set of possible order quantity decisions, and Γ^(t) is the set of time steps where the order made in the time step has a probability to arrive in period t. Additionally, the model may incorporate one or more of the following parameters. c_(iq) ^(t) is a cost at time step t ∈ T of having the inventory on-hand level (quantity) i ∈ I^(t) and making the order quantity decision q ∈ Q. ϕ^(h,t)(i|j, q) is the probability of moving from state j at time step h to state i at time step t when an order quantity q is made at time step h ∈ Γ^(t) and arrives at time step t which results in the inventory level i, and Σ_(t∈T)Σ_(h∈T)Σ_(i∈l) _(t) Σ_(j∈l) _(h) ϕ^(h,t)(i|j, q)=1. According to some embodiments, the model may incorporate one or more decision variables, such as for example, 4, the expected probability flow at time step t ∈ T when the inventory on-hand equals i ∈ I^(t) for order quantity decision q.

For inventory planning under a time dependent demand, inventory planner 110 may begin with the following model, the solution of which represents the probability of being in a certain state and time step. The inventory policy extracted from the solution of this model is time-dependent, where the inventory policy may be different at each time step.

The objective function of the model minimizes the expected total cost according to:

$\begin{matrix} {\min{\sum\limits_{t \in T}{\sum\limits_{i \in I^{t}}{\sum\limits_{q \in Q}{c_{iq}^{t}x_{iq}^{t}}}}}} & (7) \end{matrix}$

Constraint 8 controls the transitions between states and time steps.

$\begin{matrix} {{{{\sum\limits_{q \in Q}x_{iq}^{t}} - {\sum\limits_{{j \in I^{h}},{q \in Q},{h \in \Gamma^{t}}}{{\phi^{h,t}\left( {\left. i \middle| j \right.,q} \right)}x_{jq}^{h}}}} = {0{\forall{i \in I}}}},{\forall{t \in T}}} & (8) \end{matrix}$

Constraint 9 ensures that the maximum flow in the system is one.

$\begin{matrix} {{\sum\limits_{i \in I^{t}}{\sum\limits_{q \in Q_{i}^{t}}x_{iq}^{t}}} = {1{\forall{t \in T}}}} & (9) \end{matrix}$

Constraint 10 is a non-negativity constraint.

x _(iq) ^(t)≥0 ∀i∈I,∀q∈Q,∀t∈T  (10)

According to some embodiments, the above model may be extended when consistent inventory policies across time steps are required that potentially have different demand probabilities. To generate a stationary policy, one or more of the following parameters, sets, and variables may be added to the model. According to embodiments, a parameter M represents an upper bound on the number of time steps, which may be set, for example, to |T|. A set K represents the set of subsets of T (time step partition), where the inventory policy is consistent in all time steps in the same partition and there is no overlapping between the time step partitions (i.e. ∩K=Ø. A set R_(k) represents a set of possible values of a reorder point associated with the time step partition index k. A set C_(k) represents an inventory target level associated with the time step partition index k. Additionally, the following variables may be defined. y_(k) ^(r) represents a binary variable that equals one when the reorder point r is chosen for the time step partition k, and is zero otherwise. z_(k) ^(c) represents a binary variable that equals one if the inventory target level c is chosen for the time step partition k, and is zero otherwise.

According to these parameters, sets, and variables, the following constraints may be added to the objective function model to produce a stationary policy for each time step partition.

$\begin{matrix} {{{\sum\limits_{t \in k}x_{i0}^{t}} \leq {{M \cdot \left( {1 - y_{k}^{r}} \right)}{\forall{k \in K}}}},{\forall{r \in R_{k}}},{{\forall{i \in I}}❘{i \leq r}}} & (11) \end{matrix}$ $\begin{matrix} {{{\sum\limits_{t \in k}{\sum\limits_{{q \in Q}❘{q > 0}}x_{iq}^{t}}} \leq {{M \cdot \left( {1 - y_{k}^{r}} \right)}{\forall{k \in K}}}},{\forall{r \in R_{k}}},{{\forall{i \in I}}❘{i > r}}} & (12) \end{matrix}$ $\begin{matrix} {{{\sum\limits_{t \in k}{\sum\limits_{{q \in Q}❘{q > 0}}{\sum\limits_{i❘{{i + q} \neq x}}x_{iq}^{t}}}} \leq {{M \cdot \left( {1 - z_{k}^{c}} \right)}{\forall{k \in K}}}},{\forall{c \in C_{k}}}} & (13) \end{matrix}$ $\begin{matrix} {{\sum\limits_{r \in R_{k}}y_{k}^{r}} = {1{\forall{k \in K}}}} & (14) \end{matrix}$ $\begin{matrix} {{\sum\limits_{c \in C_{k}}z_{k}^{c}} = {1{\forall{k \in K}}}} & (15) \end{matrix}$

Constraints (12) and (13) impose a consistent reorder point and target level across the time steps for each partition. When the reorder point y_(k) ^(r) is chosen, then the flow of not ordering is zero (constraint (11)), i.e. if the inventory is under the reorder point r, then no order may be made. Additionally, or in the alternative, when the reorder point y_(k) ^(r) is chosen, the flow of ordering any amount when the inventory is over the reorder point is zero (constraint (12)). Constraints (14) and (15) impose that one of y_(k) ^(r), and z_(k) ^(c) can be chosen for each time step partition.

According to some embodiments, when the inventory planning problem comprises a single demand function with no time step, the inventory model may be simplified by removing the time step index. However, the transition function ϕ^(h,t) (i|j, q) and the cost function c_(iq) ^(t) may be aggregated across multiple time steps during the demand lead time, as described above in connection with the time independent demand.

When the time step is removed, inventory planner 110 utilizes the following model.

$\begin{matrix} {\min{\sum\limits_{i \in I}{\sum\limits_{q \in Q}{c_{iq}x_{iq}}}}} & (16) \end{matrix}$ $\begin{matrix} {{{\sum\limits_{q \in Q}x_{iq}} - {\sum\limits_{j \in I}{\sum\limits_{q \in Q}{{\phi\left( {\left. i \middle| j \right.,q} \right)}x_{jq}}}}} = {0{\forall{i \in I}}}} & (17) \end{matrix}$ $\begin{matrix} {{\sum\limits_{i \in I}{\sum\limits_{q \in Q}x_{iq}}} = 1} & (18) \end{matrix}$ $\begin{matrix} {{x_{iq} \geq {0{\forall{i \in I}}}},{\forall{q \in Q}}} & (19) \end{matrix}$

The solution of this model, which represents the probability of being in a certain state, is not time-dependent since time step is omitted in this model. Therefore, an inventory policy generated according to the solution of this model may comprise a stationary policy.

At activity 310, inventory planner 110 solves the generated models. According to embodiments, the generated models are solved by one or more of LP and MILP solvers.

At activity 312, the solution of the generated models may be used to generate an inventory policy. The inventory policy may comprise an (s, S) inventory policy that defines an optimal action for each possible inventory state. According to some embodiments, the inventory policy is generated by calculating a resulting state after an order action is applied for all inventory states where an order action is greater than 0 and starting from the inventory state 0. The resulting state may be defined as S. The minimal state among the generated state with an order action greater than 0 may be defined as s. Based on the list of actions per states such as equation 20, which defines pairs of (inventory state, order action), the following procedure obtains the stationary policy.

$\begin{matrix} {\pi = \begin{matrix} \begin{matrix} \begin{matrix} \begin{matrix} \begin{matrix} \begin{matrix} {- 2} & {- 1} \end{matrix} & 0 \end{matrix} & 1 \end{matrix} & 2 \end{matrix} & 3 \end{matrix} \\ \begin{bmatrix} \begin{matrix} \begin{matrix} \begin{matrix} \begin{matrix} 5 & 4 \end{matrix} & 3 \end{matrix} & 2 \end{matrix} & 0 \end{matrix} & 0 \end{bmatrix} \end{matrix}} & (20) \end{matrix}$

1: procedure RETRIEVE STATIONNARY POLICY(I, π) 2:  for i ∈ I do 3:   if i ≥ 0 and π_(i) > 0 then 4:    big_s ← i + π_(i) 5:    small_s ← i 6:    return (small_s, big_s) 7:   end if 8:  end for 9: end procedure

At activity 314, inventory planner 110 transforms the supply chain based, at least in part, on the generated inventory policy. By way of example and not limitation, inventory planner 110 may cause a supplier or distribution center to ship one or more products, a manufacturer to manufacture one or more products, and/or a retailer to receive one or more products to replenish a depleted inventory.

Reference in the foregoing specification to “one embodiment”, “an embodiment”, or “another embodiment” means that a particular feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment of the invention. The appearances of the phrase “in one embodiment” in various places in the specification are not necessarily all referring to the same embodiment.

While the exemplary embodiments have been shown and described, it will be understood that various changes and modifications to the foregoing embodiments may become apparent to those skilled in the art without departing from the spirit and scope of the present invention. 

What is claimed is:
 1. A system, comprising: a computer comprising a processor and a memory, the computer configured to: generate one or more transitional matrices; generate one or more reward matrices; model a supply chain planning problem as a Markov decision process based, at least in part, on the generated one or more transitional matrices and the generated one or more reward matrices; solve the Markov decision process, by: determining, from solution values, a resulting state after an order action is applied; generating from the solution values, indices comprising a minimal state and a target state; generate an inventory policy based, at least in part, on the solution of the modeled supply chain planning problem, wherein the computer adjusts inventory levels of at least one stocking point and adjusts sourcing of one or more supply chain entities, based at least in part, on the inventory policy; and in response to and based, at least in part, on the inventory policy, cause the one or more supply chain entities to ship one or more items.
 2. The system of claim 1, wherein the Markov decision process further comprises absorbing states, wherein the absorbing states prevent an inventory state larger than a capacity of an inventory or an unacceptable stockout level.
 3. The system of claim 1, wherein the one or more reward matrices define: one or more costs, wherein each cost of the one or more costs is associated with an action in each state of the Markov decision process; and one or more penalties, wherein each penalty of the one or more penalties is associated with a service level violation.
 4. The system of claim 1, wherein the Markov decision process further comprises a number of steps of time.
 5. The system of claim 1, wherein the Markov decision process further comprises constraints, wherein the constraints further comprise an inventory reorder point and inventory target level.
 6. The system of claim 1, wherein the one or more reward matrices further comprise an inventory cost or a backlog cost for a particular action and a particular state.
 7. The system of claim 1, wherein the computer is further configured to: aggregate the one or more transitional matrices into a single transition matrix for each order quantity.
 8. A method, comprising: generating, by a computer comprising a processor and a memory, one or more transitional matrices; generating, by the computer, one or more reward matrices; modeling, by the computer, a supply chain planning problem as a Markov decision process based, least in part, on the generated one or more transitional matrices and the generated one or more reward matrices; solving the Markov decision process, by: determining, by the computer, from solution values, a resulting state after an order action is applied; generating, by the computer, from the solution values, indices comprising a minimal state and a target state; generating, by the computer, an inventory policy based at least in part, on the solution of the modeled supply chain planning problem, wherein the computer adjusts inventory levels of at least one stocking point, based at least in part, on the inventory policy and adjusts sourcing of one or more supply chain entities; and in response to and based, at least in part, on the inventory policy, cause, by the computer, one or more items to be shipped from an inventory.
 9. The method of claim 8, wherein the Markov decision process further comprises absorbing states, wherein the absorbing states prevent an inventory state larger than a capacity of an inventory or an unacceptable stockout level.
 10. The method of claim 8, wherein the one or more reward matrices define: one or more costs, wherein each cost of the one or more costs is associated with an action in each state of the Markov decision process; and one or more penalties, wherein each penalty of the one or more penalties is associated with a service level violation.
 11. The method of claim 8, wherein the Markov decision process further comprises a number of steps of time.
 12. The method of claim 8, wherein the Markov decision process further comprises constraints, wherein the constraints further comprise an inventory reorder point and inventory target level.
 13. The method of claim 8, wherein the one or more reward matrices further comprise an inventory cost or a backlog cost for a particular action and a particular state.
 14. The method of claim 8, further comprising: aggregating, by the computer, the one or more transitional matrices into a single transition matrix for each order quantity.
 15. A non-transitory computer-readable medium embodied with software, the software when executed is configured to: generate one or more transitional matrices; generate one or more reward matrices; model a supply chain planning problem as a Markov decision process based, at least in part, on the generated one or more transitional matrices and the generated one or more reward matrices; solve the Markov decision process, by: determining, from solution values, a resulting state after an order action is applied; generating from the solution values, indices comprising a minimal state and a target state; generate an inventory policy based at least in part, on the solution of the modeled supply chain planning problem, wherein a computer adjusts inventory levels of at least one stocking point, based at least in part, on the inventory policy and adjusts sourcing of one or more supply chain entities; and in response to and based, at least in part, on the inventory policy, cause one or more items to be shipped from an inventory.
 16. The non-transitory computer-readable medium of claim 15, wherein the Markov decision process further comprises absorbing states, wherein the absorbing states prevent an inventory state larger than a capacity of an inventory or an unacceptable stockout level.
 17. The non-transitory computer-readable medium of claim 15, wherein the one or more reward matrices define: one or more costs, wherein each cost of the one or more costs is associated with an action in each state of the Markov decision process; and one or more penalties, wherein each penalty of the one or more penalties is associated with a service level violation.
 18. The non-transitory computer-readable medium of claim 15, wherein the Markov decision process further comprises a number of steps of time.
 19. The non-transitory computer-readable medium of claim 15, wherein the Markov decision process further comprises constraints, wherein the constraints further comprise an inventory reorder point and inventory target level.
 20. The non-transitory computer-readable medium of claim 15, wherein the one or more reward matrices further comprise an inventory cost or a backlog cost for a particular action and a particular state. 